Abbreviated Path Expressions With Iterated Wild Cards: WYSIWYG Semantics and Efficient Recognition
نویسندگان
چکیده
Abbreviating paths with iterated wild cards is an abstraction mechanism common to Adaptive Programming (AP), eXtensible Markup Language (XML) document processing, and Aspect Oriented Programming (AOP). Recognition of abbreviated paths is used to for navigation in both AP and XML, and to decide upon advice execution in AOP. Finite state automata have been used for efficient recognition of abbreviated paths. In this paper, we introduce cover automata for abbreviated path recognition. Cover automata have significantly lower state complexity than automata used in previous approaches. One contribution of this paper is an algorithm for constructing a cover automaton for abbreviated path recognition. We also prove the correctness of our algorithm. A second contribution of this paper is a succinct formal semantics for abbreviated paths based on regular language theory which has greatly simplified our proofs.
منابع مشابه
Abbreviated Path Expressions With Iterated Wild Cards: WYSIWYG Semantics and Efficient Implementation
Abbreviated Path expressions are used as an information hiding tool in Adaptive Programming (AP), eXtensible Markup Language (XML) document processing, and Aspect Oriented Programming (AOP). In the context of AP, the classical semantics of wild cards as place holders for any symbol leads to modularity and ambiguity problems when these wild cards are iterated. We show that a slightly restricted ...
متن کاملICM 2006 Mathematical Software
The increasing use of automatic computer processing of information re-quests a new approach in mathematical formula editors. We are used toWYSIWYG editors that produce beautiful presentation of formula. The newICT services, such as database searching or calculation web-services, requirestoring the semantic information behind a formula. This can only be donewith a new generat...
متن کاملFacial Expression Recognition Based on Anatomical Structure of Human Face
Automatic analysis of human facial expressions is one of the challenging problems in machine vision systems. It has many applications in human-computer interactions such as, social signal processing, social robots, deceit detection, interactive video and behavior monitoring. In this paper, we develop a new method for automatic facial expression recognition based on facial muscle anatomy and hum...
متن کاملCompilation of Generic Regular Path Expressions Using C++ Class Templates
Various techniques for the navigation and matching of data structures using path expressions have been the subject of extensive investigations. No matter whether such techniques are based on type information, indexing, automata, it is desirable to synthesize implementations automatically, starting from a high-level description of the path expressions to be traversed. In this paper we present a ...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کامل